20th RCRA International workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”

RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

individual papers by the papers' authors. Copying permitted only for private and academic purposes. This volume is published and copyrighted by its editors.

Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners. In: 18th RCRA workshop on Experimental Evaluation of Algorithms for Solving

When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives fo...

On Solving Combinatorial Optimization Problems

We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

On Parallel Algorithms for Combinatorial Problems

Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices or from the set E of edges, which poss...